翻訳と辞書 |
Cyclic sieving : ウィキペディア英語版 | Cyclic sieving In combinatorial mathematics, cyclic sieving is a phenomenon by which evaluating a generating function for a finite set at roots of unity counts symmetry classes of objects acted on by a cyclic group. == Definition ==
Let ''C'' be a cyclic group generated by an element ''c'' of order ''n''. Suppose ''C'' acts on a set ''X''. Let ''X''(''q'') be a polynomial with integer coefficients. Then the triple (''X'', ''X''(''q''), ''C'') is said to exhibit the cyclic sieving phenomenon (CSP) if for all integers ''d'', the value ''X''(''e''2''id''/''n'') is the number of elements fixed by ''c''''d''. In particular ''X''(1) is the cardinality of the set ''X'', and for that reason ''X''(''q'') is regarded as a generating function for ''X''.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Cyclic sieving」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|